#include <vector>
// #include <iostream>
#include <queue>
#include "../../leetcodeStruct/treenode.h"
#include <algorithm>
// #include "../leetcodeStruct/treenode"

class Solution {
private:
    int startIndex = 0;
    // std::vector<int> m_nums;
    void backtrack(std::vector<int>&nums, int startIndex){

    }
public:
    int findTargetSumWays(std::vector<int>& nums, int target) {
        this->startIndex = 0; 
    }
};

int main() {

    return 0;
}